Two Problems with Distributed Systems: Data Access Control and Memory Shering
نویسنده
چکیده
! Distributed computer system is a set of autonomous computers connected by a network of transmission channels and equipped with a distributed system software. This is a work environment for a class of tasks of common objective; the network is a communication infrastructure only. Main features of distributed systems dealt with here are: • absence of common clock for all computers – no global time provided by external service • absence of physical memory common to each computer-message exchange by the network A schematic structure of distributed system with distributed shared memory (DSM) is illustrated in Fig. 1 ([Cz 2012]). Assumptions and denotations: • the computers work in parallel and are numbered 1,2,...,n • reading and writing is governed by the memory manager of each computer;
منابع مشابه
Access control in ultra-large-scale systems using a data-centric middleware
The primary characteristic of an Ultra-Large-Scale (ULS) system is ultra-large size on any related dimension. A ULS system is generally considered as a system-of-systems with heterogeneous nodes and autonomous domains. As the size of a system-of-systems grows, and interoperability demand between sub-systems is increased, achieving more scalable and dynamic access control system becomes an im...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملThe Effect of Computer-oriented Working Memory learning on Improving Problem Solving Skills of Students with Problem Solving Difficulties in Mathematics
The purpose of this research is to determine the effects of cognitive training using software programs on improving the performance of students' skills in solving the mathematical problems. The method of this research was semi-experimental with using pre-test post-tests and control group. For this purpose, first by random multi-stage cluster, 180 male students of fourth-grade were selected, the...
متن کاملIEEE Transactions on Parallel and Distributed Systems, Vol. 13
data types; cf. Persistent objects Access control access control mechanisms in distributed, persistent memory syst. . Lopriore, L., T-PDS Oct 02 1066-1083 + Check author entry for coauthors IEEE TRANSACTIONS ON PARALLEL AN DISTRIBUTED SYSTEMS, VOL. 13, NO. 12, DECEMBER 2002 1335
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014